Algorithms for Submodular Flows ∗
نویسندگان
چکیده
SUMMARY We first describe fundamental results about submodular functions and submodular flows, which lay a basis for devising efficient algorithms for submodular flows. We then give a comprehensive survey on algorithms for submodular flows and show some possible future research directions.
منابع مشابه
Simple Push-relabel Algorithms for Matroids and Submodular Flows
We derive simple push-relabel algorithms for the matroid partitioning, matroid membership, and submodular flow feasibility problems. It turns out that, in order to have a strongly polynomial algorithm, the lexicographic rule used in all previous algorithms for the two latter problems can be avoided. Its proper role is that it helps speeding up the algorithm in the last problem.
متن کاملA polynomial cycle canceling algorithm for submodular flows
Submodular ow problems, introduced by Edmonds and Giles 2], generalize network ow problems. Many algorithms for solving network ow problems have been generalized to submodular ow problems (cf. references in Fujishige 4]), e.g. the cycle canceling method of Klein 9]. For network ow problems, the choice of minimum-mean cycles in Goldberg and Tarjan 6], and the choice of minimum-ratio cycles in Wa...
متن کاملMinimizing a sum of submodular functions
We consider the problem of minimizing a function represented as a sum of submodular terms. We assume each term allows an efficient computation of exchange capacities. This holds, for example, for terms depending on a small number of variables, or for certain cardinalitydependent terms. A naive application of submodular minimization algorithms would not exploit the existence of specialized excha...
متن کاملGraph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of “cooperati...
متن کاملGraph cuts with interacting edge weights: examples, approximations, and algorithms
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of “cooperati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000